#pragma once
#include<stdio.h>
#define MAXVEX 10
#define INF 99
typedef struct graph
{
	int Vertex[MAXVEX];//储存顶点的序号
	char Vername[MAXVEX];//储存顶点的名字
	int arc[MAXVEX][MAXVEX];//储存邻接矩阵
	int visted[MAXVEX];
	int vexnum;//顶点数
	int edgenum;//边数
}graph;
//初始化邻接矩阵
void Init(graph* ps);
//创造图
void Creat(graph* ps);
//打印邻接矩阵
void Print(graph* ps);
//寻找顶点的下标
int LocateVex(graph* ps, char ch);
//增加边
void InsetEdge(graph* ps, int i, int j, int w);
//删除边
void  DeleteEdge(graph* ps, int i, int j);
//增加顶点
void InserVex(graph* ps, char ch);
//插入顶点
void InserVex(graph* ps, char ch);
//删除顶点
void DeleteVex(graph* ps, char ch);
//找顶点第一个相邻的结点
char FirstAdjvex(graph* ps, char ch);